Tiles for Concurrent and Located Calculi

Calculi for Concurrent Objects

Concurrent object-oriented languages, such as POOL [1], ABCL [12], Obliq [3] or Java [7], usually structure the program into objects, model the parallelism with threads and the mutual exclusion with locks (or some variant of them). These attempts to integrate concurrency and object-oriented features are somehow naive and no rigorous motivation for the design choices is given. As a result, the s...

Matching Systems for Concurrent Calculi

Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and investigate matching systems for CCS, the pi-calculus and Mobile Ambients. We show among other results that the asynchronous pi-calculus with matching cannot be encoded (under certain conditions) in CCS with polyadic ...

Reduction Theories for Concurrent Calculi

Concurrent and Located Synchronizations in pi-Calculus

We present two novel semantics for π-calculus. The first allows one to observe on which channel a synchronization is performed, while the second allows concurrent actions, provided that they do not compete for resources. We present both a reduction and a labeled semantics, and show that they induce the same behavioral equivalence. As our main result we show that bisimilarity is a congruence for...

Termination in Higher-Order Concurrent Calculi

We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing concurrent calculi. However, in contrast with the λ-calculus, a simply-typed discipline need not guarantee termination; and, in contrast with message-passing calculi such as the π-calculus, divergence can be obtained even without...